The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
An algorithm for finding an optimum weight perfect matching in a graph is described. It differs from Edmonds’ “blossom” algorithm in that a perfect matching is at hand throughout the algorithm, and a feasible solution to the dual problem is obtained only at termination. In many other respects, including its efficiency, it is similar to the blossom algorithm. Some advantages of this “primal” algorithm...
Given an integer weighted bipartite graph $$\{G,w\}$$ { G , w } we consider the problems of finding all the edges that occur in some minimum weight matching of maximum cardinality and enumerating all the minimum weight perfect matchings. We construct a subgraph $$G_\mathrm{cs}$$ G cs of G, which depends on an $$\epsilon $$ ϵ -optimal solution of the dual linear program...
The use of electric vehicles as storage devices is investigated, with a view to improving the supply/demand matching of electrical networks. Consideration is given to making this supplementary function compatible with the primary function as a means of transport. Case studies showed that, where solar energy is the primary energy source, daytime charging, combined with evening/overnight regeneration,...
A hybrid model is proposed to finish image shape matching from coarse to fine, which is composed of three parts: rough matching, accurate matching, and optimum matching search. According to the partial Hausdorff distance, a fast strategy for rough matching and a new improved partial Hausdorff distance for accurate matching are presented as the measures of the degree of shape similarity between the...
In this contribution a new method to synthesise multi- band multi-frequencies matching networks is presented. The proposed approach is based on closed form and recursive relationships, allowing a direct CAD synthesis for a theoretical unlimited number of uncorrelated frequencies. Two experimental examples to design a single (2.45GHz) and double band (2 and 2.5GHz) matching networks controlling up...
This paper reports a novel MMIC balanced sub-harmonic cold FET mixer for MVDS applications using 0.15 mum GaAs pHEMT. The mixer, which includes a LO buffer amplifier, was optimized for highly linear up-conversion performance in the 40.5-43.5 GHz RF band, 19.5-20.5 GHz LO band and 2.45-3.45 GHz IF band. A dedicated simulation method has been developed to optimize conversion loss and determine optimum...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.